Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Descodificación máxima verosimilitud")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 433

  • Page / 18
Export

Selection :

  • and

Superimposed codes based on punctured convolutional codesHATTORI, M; SAITOH, Y.Electronics Letters. 1994, Vol 30, Num 13, pp 1041-1042, issn 0013-5194Article

Frog-in-the-box index codes with maximum likelihood decoding for robust scalar quantizationNA, Ilju; NEUHOFF, David L.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 428Conference Paper

Linear codes with complementary dualsMASSEY, J. L.Discrete mathematics. 1992, Vol 106-7, pp 337-342, issn 0012-365XArticle

Maximum likelihood decoding of trellis codes in fading channels with no receiver CSI is a polynomial-complexity problemHSU, Chun-Hao; ANASTASOPOULOS, Achilleas.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 147Conference Paper

Decoding spherical codes for the Gaussian channelKARLOF, J. K.IEEE transactions on information theory. 1993, Vol 39, Num 1, pp 60-65, issn 0018-9448Article

Suboptimum decoding of decomposable block codesTAKATA, Y; YAMASHITA, Y; FUJIWARA, T et al.IEEE transactions on information theory. 1994, Vol 40, Num 5, pp 1392-1405, issn 0018-9448Article

Maximum-likelihood trellis decoding technique for balanced codesMARKARIAN, G; HONARY, B; BLAUM, M et al.Electronics Letters. 1995, Vol 31, Num 6, pp 447-448, issn 0013-5194Article

User-separating demodulation for code-division multiple-access systemsRUPF, M; TARKÖY, F; MASSEY, J. L et al.IEEE journal on selected areas in communications. 1994, Vol 12, Num 5, pp 786-795, issn 0733-8716Article

New detection algorithm with reduced complexityBENELLI, G; FANTACCI, R.IEE Proceedings. I. Communications, speech and vision. 1990, Vol 137, Num 1, pp 47-59, 13 p., 1Article

Expanding Window Fountain Codes for Unequal Error ProtectionSEJDINOVIC, Dino; VUKOBRATOVIC, Dejan; DOUFEXI, Angela et al.IEEE transactions on communications. 2009, Vol 57, Num 9, pp 2510-2516, issn 0090-6778, 7 p.Article

Gallager first bounding technique for the performance evaluation of maximum-likelihood decoded linear binary block codesYOUSEFI, S.IEE proceedings. Communications. 2006, Vol 153, Num 3, pp 317-332, issn 1350-2425, 16 p.Article

Belief-propagation with information correction : Improved near maximum-likelihood decoding of low-density parity-check codesVARNICA, Nedeljko; FOSSORIER, Marc.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 343Conference Paper

On the search for high-rate quasi-orthogonal space-time block codeYUEN, Chau; YONG LIANG GUAN; TJENG THIANG TJHUNG et al.IEEE International Symposium on Personal, Indoor, and Mobile Radio Communications. 2004, pp 1647-1651, isbn 0-7803-8523-3, 4Vol, 5 p.Conference Paper

A reduced-state sequence estimation technique and its applicationsRUNSHENG HE; CRUZ, J. R; HONGXIN SONG et al.IEEE transactions on magnetics. 1999, Vol 35, Num 5, pp 2331-2333, issn 0018-9464, 1Conference Paper

Reduced-tree-based soft decoding for block-coded modulationJADHAV, A; SIDDIQI, M.IEE proceedings. Communications. 1997, Vol 144, Num 2, pp 79-83, issn 1350-2425Article

Maximum-likelihood decoding of array codes with trellis structureHONARY, B; KAYA, L; MARKARIAN, G. S et al.IEE proceedings. I. Communications, speech and vision. 1993, Vol 140, Num 5, pp 340-345, issn 0956-3776Article

Evaluation of standard approximation to log-likelihood ratio addition in the MAP algorithm, and its application in block code ('Turbo') iterative Decoding algorithmsMCMANUS, S; FARRELL, P. G.Lecture notes in computer science. 1997, pp 239-250, issn 0302-9743, isbn 3-540-63927-6Conference Paper

Novel decoding technique for the synchronous and quasi-synchronous multiple access adder channelMARKARIAN, G; BENACHOUR, P; HONARY, B et al.Lecture notes in computer science. 1997, pp 209-220, issn 0302-9743, isbn 3-540-63927-6Conference Paper

Evaluation of efficient trellis methods for soft decision decoding of Reed-Solomon codesSHIN, S. K; SWEENEY, P.IEE proceedings. Communications. 1996, Vol 143, Num 2, pp 60-67, issn 1350-2425Article

Coding for both protection and synchronisationCOULTON, P; HANNAFORD, C; HONARY, B et al.IEE proceedings. Communications. 1995, Vol 142, Num 6, pp 352-356, issn 1350-2425Article

On maximum likelihood soft-decision decoding of binary linear codesLOUS, N. J. C; BOURS, P. A. H; VAN TILBORG, H. C. A et al.IEEE transactions on information theory. 1993, Vol 39, Num 1, pp 197-203, issn 0018-9448Article

PRML method on 4/15 code and 4/11 codeTAZAKI, S; NOGUCHI, M; YAMADA, Y et al.IEEE translation journal on magnetics in Japan. 1993, Vol 8, Num 9, pp 644-651, issn 0882-4959Article

A new transform algorithm for Viterbi decodingKUEI-ANN WEN; TING-SHIUN WEN; JHING-FA WANG et al.IEEE transactions on communications. 1990, Vol 38, Num 6, pp 764-772, issn 0090-6778, 9 p.Article

On-the-Fly Maximum-Likelihood Decoding of Raptor Codes over the Binary Erasure ChannelKIM, Saejoon; LEE, Seunghyuk; HEO, Jun et al.IEICE transactions on communications. 2011, Vol 94, Num 4, pp 1062-1065, issn 0916-8516, 4 p.Article

On Minimal Tree Realizations of Linear CodesKASHYAP, Navin.IEEE transactions on information theory. 2009, Vol 55, Num 8, pp 3501-3519, issn 0018-9448, 19 p.Article

  • Page / 18